LDDoS Attack Detection by Using Ant Colony Optimization Algorithms
نویسندگان
چکیده
Internet service providers and equipment vendors are subject to cyber threats. One of the most prevalent security threats is a distributed denial of service (DDoS) attack. In a DDoS attack, the attack traffic and attacker’s IP address are respectively difficult to detect and trace. This is because attack traffic is similar to regular traffic and the attack is executed by multiple attackers. This study focused on solving the low-rate distributed denial of service (LDDoS) problem; this problem is more difficult to detect and trace compared with a DDoS attack. Therefore, this study proposes a novel distributed detection and identification ant colony system (DDIACS) framework, which is an ant-colony-optimization-based metaheuristic technique, for solving the LDDoS problem. The DDIACS framework comprises three stages, which entail an information heuristic rule, a multiagent algorithm, and a backward and forward search method. Moreover, the DDIACS framework is compliant with the emerging software defined network (SDN) because in this framework, a controller plane and data plane are used to monitor and manage the network topology. The proposed framework demonstrates SDN advantages such as enabling networks to exhibit flexibility, fast convergence, and robustness in overcoming complicated multi-attacker problems. In addition, this study investigated the time and space complexity of the DDIACS framework and compared this framework with the swarm optimization algorithm and probabilistic packet marking. This study designed the network topology by using the data set from the DARPA and KDD repository. The simulation results show that the proposed framework resolves the problems in using other algorithms and that the DDIACS framework demonstrates higher performance than existing methods do; furthermore, the adaptive metaheuristic algorithm outperforms other methods in thwarting an LDDoS attack. The detection rate is more than 89% and the accuracy is greater than 83%.
منابع مشابه
An Ant Colony Optimization Algorithm for Network Vulnerability Analysis
Intruders often combine exploits against multiple vulnerabilities in order to break into the system. Each attack scenario is a sequence of exploits launched by an intruder that leads to an undesirable state such as access to a database, service disruption, etc. The collection of possible attack scenarios in a computer network can be represented by a directed graph, called network attack gra...
متن کاملFinding the Shortest Hamiltonian Path for Iranian Cities Using Hybrid Simulated Annealing and Ant Colony Optimization Algorithms
The traveling salesman problem is a well-known and important combinatorial optimization problem. The goal of this problem is to find the shortest Hamiltonian path that visits each city in a given list exactly once and then returns to the starting city. In this paper, for the first time, the shortest Hamiltonian path is achieved for 1071 Iranian cities. For solving this large-scale problem, tw...
متن کاملGradient-based Ant Colony Optimization for Continuous Spaces
A novel version of Ant Colony Optimization (ACO) algorithms for solving continuous space problems is presented in this paper. The basic structure and concepts of the originally reported ACO are preserved and adaptation of the algorithm to the case of continuous space is implemented within the general framework. The stigmergic communication is simulated through considering certain direction vect...
متن کاملNew Ant Colony Algorithm Method based on Mutation for FPGA Placement Problem
Many real world problems can be modelled as an optimization problem. Evolutionary algorithms are used to solve these problems. Ant colony algorithm is a class of evolutionary algorithms that have been inspired of some specific ants looking for food in the nature. These ants leave trail pheromone on the ground to mark good ways that can be followed by other members of the group. Ant colony optim...
متن کاملGradient-based Ant Colony Optimization for Continuous Spaces
A novel version of Ant Colony Optimization (ACO) algorithms for solving continuous space problems is presented in this paper. The basic structure and concepts of the originally reported ACO are preserved and adaptation of the algorithm to the case of continuous space is implemented within the general framework. The stigmergic communication is simulated through considering certain direction vect...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Inf. Sci. Eng.
دوره 32 شماره
صفحات -
تاریخ انتشار 2016